Stochastic complexity in learning
نویسنده
چکیده
This is an expository paper on the latest results in the theory of stochastic complexity and the associated MDL principle with special interest in modeling problems arising in machine learning. As an illustration we discuss the problem of designing MDL decision trees, which are meant to improve the earlier designs in two ways: First, by use of the sharper formula for the stochastic complexity at the nodes the earlier found tendency of getting too small trees appears to be overcome. Second, a dynamic programming-based pruning algorithm is described for finding the optimal trees, which generalizes an algorithm described in R. Nohre (Ph.D. thesis Linkoping University, 1994). ] 1997 Academic Press
منابع مشابه
Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm
The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...
متن کاملTeaching-Learning approach in complexity paradigm
"Teaching-Learning Approach" is a model of interaction between teachers and students in an educational environment and one of the main components of the educational system. This model can be organized and designed on the basis of various opinions and ideas, including philosophical or scientific theories. This research aims to design and explain teaching-learning approach based on the complexity...
متن کاملThe effect of language complexity and group size on knowledge construction: Implications for online learning
This study investigated the effect of language complexity and group size on knowledge construction in two online debates. Knowledge construction was assessed using Gunawardena et al.’s Interaction Analysis Model (1997). Language complexity was determined by dividing the number of unique words by total words. It refers to the lexical variation. The results showed that...
متن کاملAn integrated vendor–buyer model with stochastic demand, lot-size dependent lead-time and learning in production
In this article, an imperfect vendor–buyer inventory system with stochastic demand, process quality control and learning in production is investigated. It is assumed that there are learning in production and investment for process quality improvement at the vendor’s end, and lot-size dependent lead-time at the buyer’s end. The lead-time for the first batch and those for the rest of the batches ...
متن کاملStochastic Complexity of Reinforcement Learning
Using the asymptotic equipartition property which holds on empirical sequences we elucidate the explicit performance of exploration, and the fact that the return maximization is characterized by two factors, the stochastic complexity and a quantity depending on the parameters of environment. We also examine the sensitivity of stochastic complexity, which is useful in appropriately tuning the pa...
متن کاملSome Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model
1 I n t r o d u c t i o n Since Valiant's introduction of the PAC learning model [6] for boolean functions, several extensions of the model to the learning of probability distributions were made. Yamanishi [7] and Kearns and Schapire [3] considered the problem of learning stochastic rules (or probabillstic concepts), which is the problem of learning conditional distributions. Abe and Warmuth [1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 55 شماره
صفحات -
تاریخ انتشار 1995